Flow-Based Community Detection in Hypergraphs

To connect structure, dynamics and function in systems with multibody interactions, network scientists model random walks on hypergraphs identify communities that confine the for a long time. The two flow-based community-detection methods Markov stability map equation such based different principles search algorithms. But how similar are resulting communities? We explain both methods’ machinery applied to compare them synthetic real-world using various hyperedge-size biased time scales. find is more sensitive time-scale changes biases.